Eventually Number-Conserving Cellular Automata
نویسنده
چکیده
We present a preliminary study of a new class of two-input cellular automaton rules called eventually number-conserving rules characterized by the property of evolving after a finite number of time steps to states whose number of active sites remains constant. Viewed as models of systems of interacting particles, these rules obey a kind of Darwinian principle by either annihilating unnecessary particles or creating necessary ones. Our main objective is to discuss possible characterizations and show how to determine such rules possessing a given limit set.
منابع مشابه
Simulations between triangular and hexagonal number-conserving cellular automata
A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its evolution. It can be seen as a kind of modelization of the physical conservation laws of mass or energy. In this paper, we first propose a necessary condition for triangular and hexagonal cellular automata to be number-conservi...
متن کاملNumber-conserving cellular automata I: decidability
We prove that de6nitions of number-conserving cellular automata found in literature are equivalent. A necessary and su9cient condition for cellular automata to be number-conserving is proved. Using this condition, we give a quasi-linear time algorithm to decide number-conservation. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملA New Dimension Sensitive Property for Cellular Automata
In this paper we study number-decreasing cellular automata. They form a super-class of standard number-conserving cellular automata. It is well-known that the property of being number-conserving is decidable in quasi-linear time. In this paper we prove that being number-decreasing is dimension sensitive i.e. it is decidable for one-dimensional cellular automata and undecidable for dimension 2 o...
متن کاملEnumeration of Number-Conserving Cellular Automata Rules with Two Inputs
Cellular automata (CA) rules possessing additive invariants have been studied since early 90’s. The simplest form of an additive invariant is the sum of all site values over a finite lattice with periodic boundary conditions. Rules with such an invariant are known as number-conserving rules, and they exhibit many interesting properties. For example, they can be viewed as systems of interacting ...
متن کاملUniversality and decidability of number-conserving cellular automata
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the definition of the property to include cellular automata with any set of states in Z, and show that they can be always extended to “usual” NCCA with contiguous state...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008